PTAS for MAP Assignment on Pairwise Markov Random Fields in Planar Graphs
نویسندگان
چکیده
We present a PTAS for computing the maximum a posteriori assignment on Pairwise Markov Random Fields with non-negative weights in planar graphs. This algorithm is practical and not far behind state-of-the-art techniques in image processing. MAP on Pairwise Markov Random Fields with (possibly) negative weights cannot be approximated unless P = NP, even on planar graphs. We also show via reduction that this yields a PTAS for one scoring function of Correlation Clustering in planar graphs.
منابع مشابه
A Comparison of Inference Techniques for Semi-supervised Clustering with Hidden Markov Random Fields
Recently, a number of methods have been proposed for semi-supervised clustering that employ supervision in the form of pairwise constraints. We describe a probabilistic model for semisupervised clustering based on Hidden Markov Random Fields (HMRFs) that incorporates relational supervision. The model leads to an EMstyle clustering algorithm, the E-step of which requires collective assignment of...
متن کاملMAX-CSP, Graph Cuts and Statistical Physics
Baker’s technique, which was created over three decades ago, is a powerful tool for designing polynomial time approximation schemes (PTAS) for NP-hard optimization problems on planar graphs and their generalizations. In this paper, we propose a unified framework to formulate the optimization problems where the local constraints of these problems are encoded by functions attached on the vertices...
متن کاملComputational Study on a PTAS for Planar Dominating Set Problem
The dominating set problem is a core NP-hard problem in combinatorial optimization and graph theory, and has many important applications. Baker [JACM 41,1994] introduces a k-outer planar graph decomposition-based framework for designing polynomial time approximation scheme (PTAS) for a class of NP-hard problems in planar graphs. It is mentioned that the framework can be applied to obtain an O(2...
متن کاملInferring graphical structures
We consider the problem of inferring the underlying graph using samples from a Markov random field defined on the graph. In particular, we consider the special but interesting case when the underlying graph comes from a distribution on sparse graphs. We provide matching upper and lower bounds for the sample-complexity of learning the underlying graph of a hard-core model, when the underlying gr...
متن کاملPartial Optimality of Dual Decomposition for MAP Inference in Pairwise MRFs
Markov random fields (MRFs) are a powerful tool for modelling statistical dependencies for a set of random variables using a graphical representation. An important computational problem related to MRFs, called maximum a posteriori (MAP) inference, is finding a joint variable assignment with the maximal probability. It is well known that the two popular optimisation techniques for this task, lin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1504.01311 شماره
صفحات -
تاریخ انتشار 2015